Graph homomorphisms and components of quotient graphs
نویسندگان
چکیده
منابع مشابه
Graph homomorphisms and components of quotient graphs
We study how the number c(X) of components of a graph X can be expressed through the number and properties of the components of a quotient graph X/∼ . We partially rely on classic qualifications of graph homomorphisms such as locally constrained homomorphisms and on the concept of equitable partition and orbit partition. We introduce the new definitions of pseudo-covering homomorphism and of co...
متن کاملExtremal Regular Graphs: Independent Sets and Graph Homomorphisms
This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. The main motivating problem is the following: in the family of d-regular graphs, which graph G maximize/minimize the quantity i(G), the number of independent sets in G normalized exponentially by the size of G? What if i(G) is replaced by some other grap...
متن کاملGraph Powers and Graph Homomorphisms
In this paper we investigate some basic properties of fractional powers. In this regard, we show that for any rational number 1 ≤ 2r+1 2s+1 < og(G), G 2r+1 2s+1 −→ H if and only if G −→ H− 2s+1 2r+1 . Also, for two rational numbers 2r+1 2s+1 < 2p+1 2q+1 and a non-bipartite graph G, we show that G 2r+1 2s+1 < G 2p+1 2q+1 . In the sequel, we introduce an equivalent definition for circular chromat...
متن کاملeffect of seed priming and irrigation regimes on yield,yield components and quality of safflowers cultivars
این مطالعه در سال 1386-87 در آزمایشگاه و مزرعه پژوهشی دانشگاه صنعتی اصفهان به منظور تعیین مناسب ترین تیمار بذری و ارزیابی اثر پرایمینگ بر روی سه رقم گلرنگ تحت سه رژیم آبیاری انجام گرفت. برخی از مطالعات اثرات سودمند پرایمینگ بذر را بر روی گیاهان مختلف بررسی کرده اند اما در حال حاضر اطلاعات کمی در مورد خصوصیات مربوط به جوانه زنی، مراحل نموی، عملکرد و خصوصیات کمی و کیفی بذور تیمار شده ژنوتیپ های م...
Homomorphisms of connectome graphs
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some connectome graphs are described.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rendiconti del Seminario Matematico della Università di Padova
سال: 2017
ISSN: 0041-8994
DOI: 10.4171/rsmup/138-2